A theorem on $2$-connected graphs
نویسندگان
چکیده
منابع مشابه
A Chain Theorem for 3+-Connected Graphs
4 A 3-connected graph is 3-connected if it has no 3-separation that separates a “large” fan or K3,n 5 from the rest of the graph. It is proved in this paper that, except for K4, every 3 -connected graph has 6 a 3-connected proper minor that is at most two edges away from the original graph. This result is used 7 to characterize Q-minor-free graphs, where Q is obtained from the Cube by contracti...
متن کاملTurán's theorem and k-connected graphs
The minimum size of a k-connected graph with given order and stability number is investigated. If no connectivity is required, the answer is given by Turán’s Theorem. For connected graphs, the problem has been solved recently independently by Christophe et al., and by Gitler and Valencia. In this paper, we give a short proof of their result and determine the extremal graphs. We settle the case ...
متن کاملOn Domination in 2-Connected Cubic Graphs
In 1996, Reed proved that the domination number, γ(G), of every n-vertex graph G with minimum degree at least 3 is at most 3n/8 and conjectured that γ(H) ≤ dn/3e for every connected 3-regular (cubic) n-vertex graph H. In [1] this conjecture was disproved by presenting a connected cubic graph G on 60 vertices with γ(G) = 21 and a sequence {Gk} ∞ k=1 of connected cubic graphs with limk→∞ γ(Gk) |V...
متن کاملGenerating connected and 2-edge connected graphs
We focus on the algorithm underlying the main result of [6]. This is an algebraic formula to generate all connected graphs in a recursive and efficient manner. The key feature is that each graph carries a scalar factor given by the inverse of the order of its group of automorphisms. In the present paper, we revise that algorithm on the level of graphs. Moreover, we extend the result subsequentl...
متن کامل2-connected Graphs with Small 2-connected Dominating Sets
Let G be a 2-connected graph. A subset D of V (G) is a 2-connected dominating set if every vertex of G has a neighbor in D and D induces a 2-connected subgraph. Let γ2(G) denote the minimum size of a 2-connected dominating set of G. Let δ(G) be the minimum degree of G. For an n-vertex graph G, we prove that γ2(G) ≤ n ln δ(G) δ(G) (1 + oδ(1)) where oδ(1) denotes a function that tends to 0 as δ →...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1975
ISSN: 0528-2195
DOI: 10.21136/cpm.1975.108774